TSTP Solution File: PUZ084^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : PUZ084^1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n024.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 08:49:08 EDT 2024

% Result   : Theorem 0.15s 0.40s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : PUZ084^1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36  % Computer : n024.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 18:03:08 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.15/0.37  This is a TH0_THM_EQU_NAR problem
% 0.15/0.37  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.oAQXbzJjvS/Vampire---4.8_20103
% 0.15/0.39  % (20277)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.15/0.40  % (20281)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.40  % (20277)First to succeed.
% 0.15/0.40  % (20279)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.15/0.40  % (20278)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.15/0.40  % (20283)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.15/0.40  % (20280)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.40  % (20282)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.15/0.40  % (20281)Instruction limit reached!
% 0.15/0.40  % (20281)------------------------------
% 0.15/0.40  % (20281)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40  % (20281)Termination reason: Unknown
% 0.15/0.40  % (20281)Termination phase: shuffling
% 0.15/0.40  
% 0.15/0.40  % (20281)Memory used [KB]: 1023
% 0.15/0.40  % (20281)Time elapsed: 0.004 s
% 0.15/0.40  % (20281)Instructions burned: 3 (million)
% 0.15/0.40  % (20281)------------------------------
% 0.15/0.40  % (20281)------------------------------
% 0.15/0.40  % (20284)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.15/0.40  % (20280)Instruction limit reached!
% 0.15/0.40  % (20280)------------------------------
% 0.15/0.40  % (20280)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40  % (20280)Termination reason: Unknown
% 0.15/0.40  % (20280)Termination phase: shuffling
% 0.15/0.40  
% 0.15/0.40  % (20280)Memory used [KB]: 1023
% 0.15/0.40  % (20280)Time elapsed: 0.004 s
% 0.15/0.40  % (20280)Instructions burned: 2 (million)
% 0.15/0.40  % (20280)------------------------------
% 0.15/0.40  % (20280)------------------------------
% 0.15/0.40  % (20277)Refutation found. Thanks to Tanya!
% 0.15/0.40  % SZS status Theorem for Vampire---4
% 0.15/0.40  % SZS output start Proof for Vampire---4
% 0.15/0.40  thf(type_def_5, type, mu: $tType).
% 0.15/0.40  thf(func_def_0, type, mu: $tType).
% 0.15/0.40  thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.15/0.40  thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_15, type, mtrue: $i > $o).
% 0.15/0.40  thf(func_def_16, type, mfalse: $i > $o).
% 0.15/0.40  thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.40  thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.15/0.40  thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.15/0.40  thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.15/0.40  thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.15/0.40  thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.15/0.40  thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.15/0.40  thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.15/0.40  thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.15/0.40  thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.15/0.40  thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.15/0.40  thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.15/0.40  thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.15/0.40  thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.15/0.40  thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.15/0.40  thf(func_def_33, type, peter: $i > $i > $o).
% 0.15/0.40  thf(func_def_34, type, john: $i > $i > $o).
% 0.15/0.40  thf(func_def_35, type, wife: ($i > $i > $o) > $i > $i > $o).
% 0.15/0.40  thf(func_def_53, type, sK2: $i > $o).
% 0.15/0.40  thf(func_def_54, type, ph3: !>[X0: $tType]:(X0)).
% 0.15/0.40  thf(f222,plain,(
% 0.15/0.40    $false),
% 0.15/0.40    inference(trivial_inequality_removal,[],[f221])).
% 0.15/0.40  thf(f221,plain,(
% 0.15/0.40    ($true = $false)),
% 0.15/0.40    inference(superposition,[],[f203,f219])).
% 0.15/0.40  thf(f219,plain,(
% 0.15/0.40    ($true = (sK2 @ sK1))),
% 0.15/0.40    inference(trivial_inequality_removal,[],[f217])).
% 0.15/0.40  thf(f217,plain,(
% 0.15/0.40    ($true = (sK2 @ sK1)) | ($true = $false)),
% 0.15/0.40    inference(superposition,[],[f212,f209])).
% 0.15/0.40  thf(f209,plain,(
% 0.15/0.40    ( ! [X1 : $i] : (((wife @ peter @ sK1 @ X1) = $false) | ($true = (sK2 @ X1))) )),
% 0.15/0.40    inference(not_proxy_clausification,[],[f208])).
% 0.15/0.40  thf(f208,plain,(
% 0.15/0.40    ( ! [X1 : $i] : (($true = (sK2 @ X1)) | ($true = (~ (wife @ peter @ sK1 @ X1)))) )),
% 0.15/0.40    inference(binary_proxy_clausification,[],[f207])).
% 0.15/0.40  thf(f207,plain,(
% 0.15/0.40    ( ! [X1 : $i] : (($true = ((sK2 @ X1) | (~ (wife @ peter @ sK1 @ X1))))) )),
% 0.15/0.40    inference(beta_eta_normalization,[],[f206])).
% 0.15/0.40  thf(f206,plain,(
% 0.15/0.40    ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((sK2 @ Y0) | (~ (wife @ peter @ sK1 @ Y0)))) @ X1))) )),
% 0.15/0.40    inference(pi_clausification,[],[f205])).
% 0.15/0.40  thf(f205,plain,(
% 0.15/0.40    ($true = (!! @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) | (~ (wife @ peter @ sK1 @ Y0))))))),
% 0.15/0.40    inference(not_proxy_clausification,[],[f204])).
% 0.15/0.40  thf(f204,plain,(
% 0.15/0.40    ((~ (!! @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) | (~ (wife @ peter @ sK1 @ Y0)))))) = $false)),
% 0.15/0.40    inference(binary_proxy_clausification,[],[f202])).
% 0.15/0.40  thf(f202,plain,(
% 0.15/0.40    (((~ (!! @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) | (~ (wife @ peter @ sK1 @ Y0)))))) | (sK2 @ sK1)) = $false)),
% 0.15/0.40    inference(beta_eta_normalization,[],[f201])).
% 0.15/0.40  thf(f201,plain,(
% 0.15/0.40    (((^[Y0 : $i > $o]: ((~ (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) | (~ (wife @ peter @ sK1 @ Y1)))))) | (Y0 @ sK1))) @ sK2) = $false)),
% 0.15/0.40    inference(sigma_clausification,[],[f200])).
% 0.15/0.40  thf(f200,plain,(
% 0.15/0.40    ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((~ (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) | (~ (wife @ peter @ sK1 @ Y1)))))) | (Y0 @ sK1)))) = $false)),
% 0.15/0.40    inference(beta_eta_normalization,[],[f199])).
% 0.15/0.40  thf(f199,plain,(
% 0.15/0.40    (((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) | (~ (wife @ peter @ Y0 @ Y2)))))) | (Y1 @ Y0))))) @ sK1) = $false)),
% 0.15/0.40    inference(sigma_clausification,[],[f198])).
% 0.15/0.40  thf(f198,plain,(
% 0.15/0.40    ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) | (~ (wife @ peter @ Y0 @ Y2)))))) | (Y1 @ Y0)))))))),
% 0.15/0.40    inference(beta_eta_normalization,[],[f163])).
% 0.15/0.40  thf(f163,plain,(
% 0.15/0.40    ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))) @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: ((Y3 @ Y5) | (Y4 @ Y5))))))) @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ Y1) @ Y2)))) @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4) | (~ (Y1 @ Y3 @ Y4)))))))))) @ (wife @ peter) @ Y0) @ Y0)))))),
% 0.15/0.40    inference(definition_unfolding,[],[f127,f147,f145,f153,f151])).
% 0.15/0.40  thf(f151,plain,(
% 0.15/0.40    (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.15/0.40    inference(cnf_transformation,[],[f104])).
% 0.15/0.40  thf(f104,plain,(
% 0.15/0.40    (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.15/0.40    inference(fool_elimination,[],[f103])).
% 0.15/0.40  thf(f103,plain,(
% 0.15/0.40    (mbox = (^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : (~(X0 @ X2 @ X3) | (X1 @ X3)))))),
% 0.15/0.40    inference(rectify,[],[f16])).
% 0.15/0.40  thf(f16,axiom,(
% 0.15/0.40    (mbox = (^[X6 : $i > $i > $o, X3 : $i > $o, X2 : $i] : (! [X7] : (~(X6 @ X2 @ X7) | (X3 @ X7)))))),
% 0.15/0.40    file('/export/starexec/sandbox2/tmp/tmp.oAQXbzJjvS/Vampire---4.8_20103',mbox)).
% 0.15/0.40  thf(f153,plain,(
% 0.15/0.40    (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.15/0.40    inference(definition_unfolding,[],[f142,f140,f132])).
% 0.15/0.40  thf(f132,plain,(
% 0.15/0.40    (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.15/0.40    inference(cnf_transformation,[],[f94])).
% 0.15/0.40  thf(f94,plain,(
% 0.15/0.40    (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.15/0.40    inference(fool_elimination,[],[f93])).
% 0.15/0.40  thf(f93,plain,(
% 0.15/0.40    (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.15/0.40    inference(rectify,[],[f3])).
% 0.15/0.40  thf(f3,axiom,(
% 0.15/0.40    (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 0.15/0.40    file('/export/starexec/sandbox2/tmp/tmp.oAQXbzJjvS/Vampire---4.8_20103',mnot)).
% 0.15/0.40  thf(f140,plain,(
% 0.15/0.40    (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.15/0.40    inference(cnf_transformation,[],[f83])).
% 0.15/0.40  thf(f83,plain,(
% 0.15/0.40    (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.15/0.40    inference(fool_elimination,[],[f82])).
% 0.15/0.40  thf(f82,plain,(
% 0.15/0.40    ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) | (X0 @ X2))) = mor)),
% 0.15/0.40    inference(rectify,[],[f4])).
% 0.15/0.40  thf(f4,axiom,(
% 0.15/0.40    ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X4 @ X2) | (X3 @ X2))) = mor)),
% 0.15/0.40    file('/export/starexec/sandbox2/tmp/tmp.oAQXbzJjvS/Vampire---4.8_20103',mor)).
% 0.15/0.40  thf(f142,plain,(
% 0.15/0.40    (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.15/0.40    inference(cnf_transformation,[],[f69])).
% 0.15/0.40  thf(f69,plain,(
% 0.15/0.40    (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.15/0.40    inference(fool_elimination,[],[f68])).
% 0.15/0.40  thf(f68,plain,(
% 0.15/0.40    ((^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)) = mimplies)),
% 0.15/0.40    inference(rectify,[],[f6])).
% 0.15/0.40  thf(f6,axiom,(
% 0.15/0.40    ((^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)) = mimplies)),
% 0.15/0.40    file('/export/starexec/sandbox2/tmp/tmp.oAQXbzJjvS/Vampire---4.8_20103',mimplies)).
% 0.15/0.40  thf(f145,plain,(
% 0.15/0.40    (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.15/0.40    inference(cnf_transformation,[],[f64])).
% 0.15/0.40  thf(f64,plain,(
% 0.15/0.40    (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.15/0.40    inference(fool_elimination,[],[f63])).
% 0.15/0.40  thf(f63,plain,(
% 0.15/0.40    ((^[X0 : ($i > $o) > $i > $o, X1 : $i] : (! [X2 : $i > $o] : (X0 @ X2 @ X1))) = mforall_prop)),
% 0.15/0.40    inference(rectify,[],[f11])).
% 0.15/0.40  thf(f11,axiom,(
% 0.15/0.40    ((^[X3 : ($i > $o) > $i > $o, X2 : $i] : (! [X5 : $i > $o] : (X3 @ X5 @ X2))) = mforall_prop)),
% 0.15/0.40    file('/export/starexec/sandbox2/tmp/tmp.oAQXbzJjvS/Vampire---4.8_20103',mforall_prop)).
% 0.15/0.40  thf(f147,plain,(
% 0.15/0.40    (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.40    inference(cnf_transformation,[],[f54])).
% 0.15/0.40  thf(f54,plain,(
% 0.15/0.40    (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.40    inference(fool_elimination,[],[f53])).
% 0.15/0.40  thf(f53,plain,(
% 0.15/0.40    (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.15/0.40    inference(rectify,[],[f28])).
% 0.15/0.40  thf(f28,axiom,(
% 0.15/0.40    (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.15/0.40    file('/export/starexec/sandbox2/tmp/tmp.oAQXbzJjvS/Vampire---4.8_20103',mvalid)).
% 0.15/0.40  thf(f127,plain,(
% 0.15/0.40    ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ (wife @ peter) @ Y0) @ Y0)))))),
% 0.15/0.40    inference(cnf_transformation,[],[f113])).
% 0.15/0.40  thf(f113,plain,(
% 0.15/0.40    ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ (wife @ peter) @ Y0) @ Y0)))))),
% 0.15/0.40    inference(flattening,[],[f87])).
% 0.15/0.40  thf(f87,plain,(
% 0.15/0.40    ~($true = (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ (wife @ peter) @ Y0) @ Y0)))))),
% 0.15/0.40    inference(fool_elimination,[],[f86])).
% 0.15/0.40  thf(f86,plain,(
% 0.15/0.40    ~(mvalid @ (mforall_prop @ (^[X0 : $i > $o] : (mimplies @ (mbox @ (wife @ peter) @ X0) @ X0))))),
% 0.15/0.40    inference(rectify,[],[f39])).
% 0.15/0.40  thf(f39,negated_conjecture,(
% 0.15/0.40    ~(mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mimplies @ (mbox @ (wife @ peter) @ X11) @ X11))))),
% 0.15/0.40    inference(negated_conjecture,[],[f38])).
% 0.15/0.40  thf(f38,conjecture,(
% 0.15/0.40    (mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mimplies @ (mbox @ (wife @ peter) @ X11) @ X11))))),
% 0.15/0.40    file('/export/starexec/sandbox2/tmp/tmp.oAQXbzJjvS/Vampire---4.8_20103',conj)).
% 0.15/0.40  thf(f212,plain,(
% 0.15/0.40    ( ! [X1 : $i] : (($true = (wife @ peter @ X1 @ X1))) )),
% 0.15/0.40    inference(beta_eta_normalization,[],[f211])).
% 0.15/0.40  thf(f211,plain,(
% 0.15/0.40    ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (wife @ peter @ Y0 @ Y0)) @ X1))) )),
% 0.15/0.40    inference(pi_clausification,[],[f210])).
% 0.15/0.40  thf(f210,plain,(
% 0.15/0.40    ($true = (!! @ $i @ (^[Y0 : $i]: (wife @ peter @ Y0 @ Y0))))),
% 0.15/0.40    inference(beta_eta_normalization,[],[f167])).
% 0.15/0.40  thf(f167,plain,(
% 0.15/0.40    ($true = ((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))) @ (wife @ peter)))),
% 0.15/0.40    inference(definition_unfolding,[],[f150,f128])).
% 0.15/0.40  thf(f128,plain,(
% 0.15/0.40    (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.15/0.40    inference(cnf_transformation,[],[f75])).
% 0.15/0.40  thf(f75,plain,(
% 0.15/0.40    (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.15/0.40    inference(fool_elimination,[],[f74])).
% 0.15/0.40  thf(f74,plain,(
% 0.15/0.40    ((^[X0 : $i > $i > $o] : (! [X1] : (X0 @ X1 @ X1))) = mreflexive)),
% 0.15/0.40    inference(rectify,[],[f18])).
% 0.15/0.40  thf(f18,axiom,(
% 0.15/0.40    ((^[X6 : $i > $i > $o] : (! [X8] : (X6 @ X8 @ X8))) = mreflexive)),
% 0.15/0.40    file('/export/starexec/sandbox2/tmp/tmp.oAQXbzJjvS/Vampire---4.8_20103',mreflexive)).
% 0.15/0.40  thf(f150,plain,(
% 0.15/0.40    ((mreflexive @ (wife @ peter)) = $true)),
% 0.15/0.40    inference(cnf_transformation,[],[f96])).
% 0.15/0.40  thf(f96,plain,(
% 0.15/0.40    ((mreflexive @ (wife @ peter)) = $true)),
% 0.15/0.40    inference(fool_elimination,[],[f95])).
% 0.15/0.40  thf(f95,plain,(
% 0.15/0.40    (mreflexive @ (wife @ peter))),
% 0.15/0.40    inference(rectify,[],[f34])).
% 0.15/0.40  thf(f34,axiom,(
% 0.15/0.40    (mreflexive @ (wife @ peter))),
% 0.15/0.40    file('/export/starexec/sandbox2/tmp/tmp.oAQXbzJjvS/Vampire---4.8_20103',refl_wife_peter)).
% 0.15/0.40  thf(f203,plain,(
% 0.15/0.40    ((sK2 @ sK1) = $false)),
% 0.15/0.40    inference(binary_proxy_clausification,[],[f202])).
% 0.15/0.40  % SZS output end Proof for Vampire---4
% 0.15/0.40  % (20277)------------------------------
% 0.15/0.40  % (20277)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40  % (20277)Termination reason: Refutation
% 0.15/0.40  
% 0.15/0.40  % (20277)Memory used [KB]: 5628
% 0.15/0.40  % (20277)Time elapsed: 0.012 s
% 0.15/0.40  % (20277)Instructions burned: 12 (million)
% 0.15/0.40  % (20277)------------------------------
% 0.15/0.40  % (20277)------------------------------
% 0.15/0.40  % (20276)Success in time 0.027 s
% 0.15/0.40  % Vampire---4.8 exiting
%------------------------------------------------------------------------------